Mechanised Separation Algebra
نویسندگان
چکیده
We present an Isabelle/HOL library with a generic type class implementation of separation algebra, develop basic separation logic concepts on top of it, and implement generic automated tactic support that can be used directly for any instantiation of the library. We show that the library is usable by multiple example instantiations that include common as well as more exotic base structures such as heap and virtual memory, and report on our experience using it in operating systems kernel
منابع مشابه
Separation Algebra
We present a generic type class implementation of separation algebra for Isabelle/HOL as well as lemmas and generic tactics which can be used directly for any instantiation of the type class. The ex directory contains example instantiations that include structures such as a heap or virtual memory. The abstract separation algebra is based upon “Abstract Separation Logic” by Calcagno et al. These...
متن کاملAn Integration of Mechanised Reasoning andComputer
Mechanised reasoning systems and computer algebra systems have apparently diierent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two diierent tasks, proving and calculating, have to be performed. Even more importantly, proof and computation are often interwoven and not easily separable. In the context of producing reliable proofs, the quest...
متن کاملIntegrating Computer Algebra with Proof Planning Sign and Implementation of Symbolic Compu- Tation Systems, Spinger-verlag, Forthcoming Integrating Computer Algebra with Proof Planning
Mechanised reasoning systems and computer algebra systems have apparently diierent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two diierent tasks, proving and calculating, have to be performed. In the context of producing reliable proofs, the question how to ensure correctness when integrating a computer algebra system into a mechanised r...
متن کاملIntegrating Computer Algebra with Proof Planning
Mechanised reasoning systems and computer algebra systems have apparently di erent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two di erent tasks, proving and calculating, have to be performed. In the context of producing reliable proofs, the question how to ensure correctness when integrating a computer algebra system into a mechanised r...
متن کاملAn Integration of Mechanised Reasoning
Mechanised reasoning systems and computer algebra systems have apparently di erent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two di erent tasks, proving and calculating, have to be performed. Even more importantly, proof and computation are often interwoven and not easily separable. In the context of producing reliable proofs, the quest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012